Some new results on Borel irreducibility of equivalence relations ∗
نویسندگان
چکیده
We prove that orbit equivalence relations (ERs, for brevity) of generically turbulent Polish actions are not Borel reducible to ERs of a family which includes Polish actions of S∞, the group of all permutations of N, and is closed under the Fubini product modulo the ideal Fin of all finite sets, and some other operations. Our second main result shows that T2, an equivalence relation called “the equality of countable sets of the reals”, is not Borel reducible to another family of ERs which includes continuous actions of Polish CLI groups, Borel equivalence relations with Gδσ classes, some ideals, and is closed under the Fubini product over Fin. Both results and their corollaries extend some earlier irreducibility theorems by Hjorth and Kechris.
منابع مشابه
Irreducibility on General Fuzzy Automata
The aim of this paper is the study of a covering of a max-mingeneral fuzzy automaton by another, admissible relations, admissiblepartitions of a max-min general fuzzy automaton,$tilde{delta}$-orthogonality of admissible partitions, irreduciblemax-min general fuzzy automata. Then we obtain the relationshipsbetween them.
متن کاملSome Applications of the Adams-kechris Technique
We analyze the technique used by Adams and Kechris (2000) to obtain their results about Borel reducibility of countable Borel equivalence relations. Using this technique, we show that every Σ1 equivalence relation is Borel reducible to the Borel bi-reducibility of countable Borel equivalence relations. We also apply the technique to two other classes of essentially uncountable Borel equivalence...
متن کاملHow Many Turing Degrees are There ?
A Borel equivalence relation on a Polish space is countable if all of its equivalence classes are countable. Standard examples of countable Borel equivalence relations (on the space of subsets of the integers) that occur in recursion theory are: recursive isomorphism, Turing equivalence, arithmetic equivalence, etc. There is a canonical hierarchy of complexity of countable Borel equivalence rel...
متن کاملDougherty And
A Borel equivalence relation on a Polish space is countable if all of its equivalence classes are countable. Standard examples of countable Borel equivalence relations (on the space of subsets of the integers) that occur in recursion theory are: recursive isomorphism, Turing equivalence, arithmetic equivalence, etc. There is a canonical hierarchy of complexity of countable Borel equivalence rel...
متن کاملA “feldman–moore” Representation Theorem for Countable Borel Equivalence Relations on Quotient Spaces
We consider countable Borel equivalence relations on quotient Borel spaces. We prove a generalization of the representation theorem of Feldman–Moore, but provide some examples showing that other very simple properties of countable equivalence relations on standard Borel spaces may fail in the context of nonsmooth quotients. In this paper we try to analyze some very basic questions about the str...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008